# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def chalkReplacer(self, chalk: List[int], k: int) -> int:
        total_chalk_count = sum(chalk)
        last_loop_chalk = k % total_chalk_count

        for i in range(len(chalk)):
            if last_loop_chalk < chalk[i]:
                return i
            else:
                last_loop_chalk -= chalk[i]

        return 0


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([5, 1, 5], 22, 0),
        ([3, 4, 1, 2], 25, 1)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.chalkReplacer(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

